BER Analysis Using Log-Map Decoding Algorithm for Turbo Codes Channel
نویسندگان
چکیده
Turbo codes are a new class of forward error correcting codes that have proved to give a performance close to the channel capacity as proposed by C. Shannon. A turbo code encoder is formed by the parallel concatenation of two identical recursive convolutional encoders separated by an interleaver. The turbo code decoder utilizes two cascaded decoding blocks where each block in turn shares a priori information produced by the other. The decoding scheme has the benefit to work iteratively such that the overall performance can be improved. In this paper, a performance analysis of turbo codes is carried out. Log maximum a posteriori probability (Log-MAP) algorithm is used in the performance analysis. The effect of using different decoding schemes is studied on both punctured and unpunctured codes. Simulations are carried out with the help of MATLAB tools.
منابع مشابه
Performance of Turbo Codes with Max-Log-MAP Decoding on Rayleigh Fading Channels
In this paper we investigate performance of turbo codes with Max-Log-MAP decoding on slow, flat Rayleigh fading channels. In order to simplify decoding algorithm implementation for a fading channel, the Gaussian distribution is applied to a channel metric. By means of computer simulations, we estimate BER of turbo codes on fully-interleaved and correlated channels with ideal CSI and without CSI...
متن کاملPerformance of Turbo Codes Using Code Generator [13, 15] and [31, 17] in AWGN and Fading Channel
Turbo coding is a very powerful error correction technique that has made a tremendous impact on channel coding in the last few years. They are recommended for increased capacity at higher transmission rates due to their superior performance over conventional codes. Turbo codes use any one of the decoding algorithms, Maximum a posteriori Probability (log MAP), Soft Output Viterbi Algorithm (SOVA...
متن کاملBER Analysis of Turbo Coded Channel
Turbo codes are a new class of forward error correcting codes that have proved to give a performance close to the channel capacity as proposed by C. Shannon. A turbo code encoder is formed by the parallel concatenation of two identical recursive convolutional encoders separated by an interleaver. The turbo code decoder utilizes two cascaded decoding blocks where each block in turn shares a prio...
متن کاملImproved upper bound on the bit error probability of turbo codes for ML decoding with imperfect CSI in a Rayleigh fading channel
− In this paper, we investigate an improved upper bound on the bit error probability of turbo codes for the maximum likelihood (ML) decoding with imperfect channel state information (CSI) in a fully interleaved Rayleigh fading channel. The upper bound is based on recently introduced Viterbi & Viterbi bound and is also compared with iterative decoding using the Log-MAP algorithm. It is shown tha...
متن کاملLow Complexity Decoder for CCSDS Turbo codes
Error correction codes are a means of including redundancy in a stream of information bits to allow the detection and correction of symbol errors during transmission. In Forward Error Correction (FEC) it is desirable to have low Bit Error Rates (BER) and low decoder complexity for reliable data transmission Turbo code is a great achievement in the field of communication system. Turbo code also ...
متن کامل